finite domain - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

finite domain - перевод на русский

NUMERICAL SOLUTION METHOD OF COMPUTATIONAL ELECTROMAGNETICS
Fdfd; Finite-Difference Frequency-Domain; Finite-difference frequency-domain
Найдено результатов: 682
finite domain      

математика

конечная область

finite domain      
конечная область
function domain         
  • f}}.
SET OF "INPUT" OR ARGUMENT VALUES FOR WHICH THE FUNCTION IS DEFINED
Function domain; Codomain space; Replacement set; Domain (function); Domain of a definition

математика

область определения функции

accepting state         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

математика

поглощающее состояние

finite element analysis         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis

строительное дело

расчёт методом конечных элементов

atomic ring         
INTEGRAL DOMAIN IN WHICH EVERY NON-ZERO NON-UNIT IS A FINITE PRODUCT OF IRREDUCIBLE ELEMENTS
Atomic ring; Half-factorial domain; Bounded factorization domain; Factorization domain; Finite factorization domain

математика

атомарное кольцо

factorization domain         
INTEGRAL DOMAIN IN WHICH EVERY NON-ZERO NON-UNIT IS A FINITE PRODUCT OF IRREDUCIBLE ELEMENTS
Atomic ring; Half-factorial domain; Bounded factorization domain; Factorization domain; Finite factorization domain

математика

область разложения (на множители)

finite state machine         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

общая лексика

конечный автомат, КА

вычислительная модель, описывающая автомат с конечным числом состояний. Одно из них называется "начальным состоянием". Автомат переходит из одного состояния в другое под влиянием "управления", зависящего от внешних воздействий: получаемых сигналов или данных. Назначением каждого состояния является запоминание определённого момента истории системы. По типу управления КА делятся на детерминированные (находящиеся в каждый момент времени только в одном состоянии) и недетерминированные (могут одновременно находиться в нескольких состояниях). КА широко применяются в программировании, например в лексических анализаторах компиляторов

синоним

finite-state machine; FSM

Смотрите также

cumulative throughflow; fractional throughflow

finite element method         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis

строительное дело

метод конечных элементов

finite element method         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis
[матем.] метод конечных элементов

Определение

экспроприация
ж.
1) Принудительное безвозмездное - конфискация - или оплачиваемое - реквизиция - изъятие чего-л., производимое государственными органами.
2) Лишение одним классом или одним из слоев класса собственности и прежнего социального положения другого класса или другого слоя того же класса.
3) Любое принудительное отчуждение чего-л.

Википедия

Finite-difference frequency-domain method

The finite-difference frequency-domain (FDFD) method is a numerical solution method for problems usually in electromagnetism and sometimes in acoustics, based on finite-difference approximations of the derivative operators in the differential equation being solved.

While "FDFD" is a generic term describing all frequency-domain finite-difference methods, the title seems to mostly describe the method as applied to scattering problems. The method shares many similarities to the finite-difference time-domain (FDTD) method, so much that the literature on FDTD can be directly applied. The method works by transforming Maxwell's equations (or other partial differential equation) for sources and fields at a constant frequency into matrix form A x = b {\displaystyle Ax=b} . The matrix A is derived from the wave equation operator, the column vector x contains the field components, and the column vector b describes the source. The method is capable of incorporating anisotropic materials, but off-diagonal components of the tensor require special treatment.

Strictly speaking, there are at least two categories of "frequency-domain" problems in electromagnetism. One is to find the response to a current density J with a constant frequency ω, i.e. of the form J ( x ) e i ω t {\displaystyle \mathbf {J} (\mathbf {x} )e^{i\omega t}} , or a similar time-harmonic source. This frequency-domain response problem leads to an A x = b {\displaystyle Ax=b} system of linear equations as described above. An early description of a frequency-domain response FDTD method to solve scattering problems was published by Christ and Hartnagel (1987). Another is to find the normal modes of a structure (e.g. a waveguide) in the absence of sources: in this case the frequency ω is itself a variable, and one obtains an eigenproblem A x = λ x {\displaystyle Ax=\lambda x} (usually, the eigenvalue λ is ω2). An early description of an FDTD method to solve electromagnetic eigenproblems was published by Albani and Bernardi (1974).

Как переводится finite domain на Русский язык